User Adjustable Process Scheduling Mechanism for a Multiprocessor Embedded System
نویسنده
چکیده
The multiprocessor computer systems become more popular for the improvement of the processor’s design and fabrication’s evolution. In the past, the multiprocessors systems are usually adopted in server systems. Nowadays, the configurations of multiprocessor are also adopted in the personal computers or embedded systems. But we cannot achieve the optimal performance of the multiprocessor systems efficiently because task-scheduling mechanism cannot be adjusted for the real performing situation. Even the task-scheduler of the operating system cannot handle this problem. Also, the parallel program is hard to develop for the specific system to improve performance. In this paper, we provide a tool, called MONOPOLY, for users to adjust the scheduling policies of OS dynamically. It can improve the utilization of the multiple processors’ resources by allowing user to occupy a processor to make the specified program execute solely. In our experiment, the results show that the program will finish faster by using MONOPOLY. When the system is fully loaded, the execution time of the program with MONOPOLY will be much shorter then the program without this tool. Key-word: MONOPOLY, Multiprocessor, User Adjustable Process Scheduling, Operating System, Embedded System
منابع مشابه
Multiprocessor Scheduling For Real Time Systems Embedded Systems
energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملScheduling in multiprocessor systems pdf
Contemporary computer systems are multiprocessor or multicomputer machines. This chapter will introduce the basics of multiprocessor scheduling. Consequently, the eld of scheduling for multiprocessor systems.The main motivation for multiprocessor scheduling is the desire for increased. The scheduling problem for multiprocessor systems can be generally stated as.Concurrency implemented by schedu...
متن کاملA Comparison of Clustering and Scheduling Techniques for Embedded Multiprocessor Systems
In this paper we extensively explore and illustrate the effectiveness of the two-phase decomposition of scheduling — into clustering and cluster-scheduling or merging — and mapping task graphs onto embedded multiprocessor systems. We describe efficient and novel partitioning (clustering) and scheduling techniques that aggressively streamline interprocessor communication and can be tuned to expl...
متن کاملABSTRACT Title of dissertation: System Synthesis for Embedded Multiprocessors
Title of dissertation: System Synthesis for Embedded Multiprocessors Vida Kianzad, Doctor of Philosophy, 2006 Dissertation directed by: Professor Shuvra S. Bhattacharyya Department of Electrical and Computer Engineering Modern embedded systems must increasingly accommodate dynamically changing operating environments, high computational requirements, flexibility (e.g., for the emergence of new s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006